International Journal of Computational Geometry & Applications C World Scientiic Publishing Company Parallelizing an Algorithm for Visibility on Polyhedral Terrain

International Journal of Computational Geometry & Applications C World Scientiic Publishing Company an Algorithm for Drawing a Hierarchical Graph

International Journal of Computational Geometry & Applications C World Scientiic Publishing Company Rounding Arrangements Dynamically

Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation. The algorithm is robust because, following Greene 1 and Hobby, 2 it rounds the endpoints and intersections of all line segments to representable points, but in a way that is globa...

International Journal of Computational Geometry & Applications C World Scientiic Publishing Company Virtual Geoexploration: Concepts and Design Choices

A trip through a virtual world is a powerful metaphor and a natural way of interacting with a geographic information system (GIS). Virtual reality (VR) systems provide visual realism and real-time navigation and interaction for data in core, but fail to cope with very large amounts of data, and to provide the general functionality of information systems. We describe a prototype system that over...

F G Representing the Visibility Structure of a Polyhedral Terrain through a Horizon Map : Digital Terrain Models, Visibility, Data Structures, Horizons : a Horizon-based Visibility Map for Terrains

horizon map Representing the Visibility Structure of a Polyhedral Terrain through a Horizon Map We present a model for describing the visibility of a polyhedral terrain from a xed viewpoint, based on a collection of nested horizons. We brie y introduce the concepts of mathematical and digital terrain models, and some background notions for visibility problems on terrains. Then, we de ne horizon...

Geometric Facility Location Optimization Thesis

This thesis is in Computational Geometry. Computational Geometry is a subfield of Computer Science that deals with problems of a geometric nature that arise in application domains such as Computer Graphics, Robotics, Geographic Information Systems (GIS), and Molecular Biology. More specifically, in this thesis we conduct research in Computational Geometry in the context of (Geometric) Facility ...